Computing Plan-Length Bounds Using Lengths of Longest Paths
نویسندگان
چکیده
We devise a method to exactly compute the length of longest simple path in factored state spaces, like spaces encountered classical planning. Although complexity this problem is NEXP-Hard, we show that our can be used practically useful upper-bounds on lengths plans. computed are significantly better than bounds produced by state-of-the-art bounding techniques and they improve SAT-based
منابع مشابه
Relative Length of Longest Paths and Cycles in Graphs
For a graphG, let diff(G) = p(G)− c(G), where p(G) and c(G) denote the orders of a longest path and a longest cycle inG, respectively. LetG be a 3-connected graph of order n. In the paper, we give a best-possible lower bound to σ4(G) to assure diff(G) ≤ 1. The result settles a conjecture in J. Graph Theory 37 (2001), 137–156.
متن کاملRelative length of longest paths and longest cycles in triangle-free graphs
In this paper, we study triangle-free graphs. Let G = (VG, EG) be an arbitrary triangle-free graph with minimum degree at least two and σ4(G) ≥ |VG|+2. We first show that either for any path P in G there exists a cycle C such that |VP \ VC | ≤ 1, or G is isomorphic to exactly one exception. Using this result, we show that for any set S of at most δ vertices in G there exists a cycle C such that...
متن کاملOn Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that t...
متن کاملTransversals of Longest Paths
Let lpt(G) be the minimum cardinality of a set of vertices that intersects all longest paths in a graph G. Let ω(G) be the size of a maximum clique in G, and tw(G) be the treewidth of G. We prove that lpt(G) ≤ max{1,ω(G)− 2} when G is a connected chordal graph; that lpt(G) = 1 when G is a connected bipartite permutation graph or a connected full substar graph; and that lpt(G) ≤ tw(G) for any co...
متن کاملComputing Upper Bounds on Lengths of Transition Sequences
We describe an approach to computing upper bounds on the lengths of solutions to reachability problems in transition systems. It is based on a decomposition of state-variable dependency graphs (causal graphs). Our approach is able to find practical upper bounds in a number of planning benchmarks. Computing the bounds is computationally cheap in practice, and in a number of benchmarks our algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i13.17392